Code constructions for multi-node exact repair in distributed storage
نویسندگان
چکیده
منابع مشابه
Explicit Code Constructions for Distributed Storage Minimizing Repair Bandwidth
Regenerating codes are a class of recently developed codes for distributed storage, that permit data recovery from any k of n nodes, and also have the capability of repairing a failed node by connecting to any d nodes and downloading an amount of data, termed the repair bandwidth, that is on average, significantly less than the size of the data file. These codes optimally trade the storage spac...
متن کاملCode Constructions for Distributed Storage With Low Repair Bandwidth and Low Repair Complexity
We present the construction of a family of erasure correcting codes for distributed storage systems that achieve low repair bandwidth and low repair complexity. The construction is based on two classes of codes, where the primary goal of the first class of codes is to achieve a good fault tolerance, while the second class of codes aims at reducing the repair bandwidth and the repair complexity....
متن کاملExact Regeneration Codes for Distributed Storage Repair Using Interference Alignment
The high repair cost of (n, k) Maximum Distance Separable (MDS) erasure codes has recently motivated a new class of codes, called Regenerating Codes, that optimally trade off storage cost for repair bandwidth. On one end of this spectrum of Regenerating Codes are Minimum Storage Regenerating (MSR) codes that can match the minimum storage cost of MDS codes while also significantly reducing repai...
متن کاملCooperative repair of multiple node failures in distributed storage systems
Cooperative regenerating codes are designed for repairing multiple node failures in distributed storage systems. In contrast to the original repair model of regenerating codes, which are for the repair of single node failure, data exchange among the new nodes is enabled. It is known that further reduction in repair bandwidth is possible with cooperative repair. Currently in the literature, we h...
متن کاملDistributed storage systems with secure and exact repair - New results
Distributed storage systems (DSS) in the presence of a passive eavesdropper are considered in this paper. A typical DSS is characterized by 3 parameters (n, k, d) where, a file is stored in a distributed manner across n nodes such that it can be recovered entirely from any k out of n nodes. Whenever a node fails, d 2 [k, n) nodes participate in the repair process. In this paper, we study the ex...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Science China Information Sciences
سال: 2018
ISSN: 1674-733X,1869-1919
DOI: 10.1007/s11432-018-9516-6